Multimedia Real-Time Disk Scheduling by Hybrid Local/Global Seek-Optimizing Approaches
نویسندگان
چکیده
Real-time disk scheduling is one of the most important problems in designing a multimedia system. It has been proved to be NP-Complete. In these years, various approaches are proposed to improve disk throughput under guaranteed real-time requirements. SCAN-EDF, which utilizes SCAN to reschedule tasks in a real-time EDF schedule, is one of the best-known real-time disk scheduling methods. Since tasks rescheduled in SCAN-EDF should have the sume deadline, its efficiency depends oti the number of tasks with the same deadlines. I f all tasks have different deadlines, the schedule result of SCAN-EDF would be the same us EDF. In this paper, we improve SCAN-EDF b y applying diflerent hybrid local-merging and global-inserting schemes. Different from SCAN-EDF, in our method, tasks rescheduled b j SCAN may have different deadlines. Our efficiency is not limited on the number of tasks that have the same deadlines. Experiments show that the proposed method is significantly better than SCAN-EDF. Comparing by disk throughput, the amount of our improvement obtained is 24% more than the best-known SCAN-EDF method.
منابع مشابه
GSR: A global seek-optimizing real-time disk-scheduling algorithm
Earliest-deadline-first (EDF) is good for scheduling real-time tasks in order to meet timing constraint. However, it is not good enough for scheduling real-time disk tasks to achieve high disk throughput. In contrast, although SCAN can maximize disk throughput, its schedule results may violate real-time requirements. Thus, during the past few years, various approaches were proposed to combine E...
متن کاملEvaluation of Scheduling Algorithms for Real-Time Disk I/O
Real-time disk I/O scheduling is extremely important to the performance improvement of the whole real-time system since the disk devices are the system’s bottleneck. To meet time constraints, some conventional algorithm, such as EDF, Least Slack Time First, Rate Monotonic, can be used to schedule disk I/O. However, these algorithms ignore the relative position of requested data on the disks, he...
متن کاملA new real time disk-scheduling method based on GSR algorithm
Disk scheduling has an important role in QOS guarantee of soft real-time environments such as videoon-demand and multimedia servers. Since now, some disk-scheduling algorithms have been proposed to schedule real-time disk requests. One of the most recent algorithms is global seek-optimizing realtime (GSR) that schedules the disk requests with different ready times by a global regrouping scheme....
متن کاملA Tight Upper Bound of the Lumped Disk Seek Time for the Scan Disk Scheduling Policy
A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy is presented. The tight upper bound is based on an accurate disk seek time model. One of the most important applications of the tight upper bound is in multimedia storage system design. Without a tight upper bound based on an accurate disk seek time model, the designers of multimedia storage systems would be fo...
متن کاملDeadline-Modification-SCAN with Maximum-Scannable-Groups for Multimedia Real-Time Disk Scheduling
suitable disk layout and network transmission schedule to minimize allocated resources (buffer size, bandwidth, ..., etc.) with maximum resource utilization. In this paper, the real-time disk scheduling problem to balance the trade-off between satisfying real-time constraints and minimizing the disk service time is considered. It is an interesting and practical problem for real-time storage man...
متن کامل